#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;

int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}

ll qmi(ll a, ll b)
{
    ll res = 1;
    while(b)
    {
        if(b & 1)res = res * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return res;
}
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		x ^= x << 13;
		x ^= x >> 7;
		x ^= x << 17;
		return x; 
	}
	size_t operator () (uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); // 时间戳
		return splitmix64(x + FIXED_RANDOM);
	}
};

void solve()
{
    int n;
    cin >> n;
    vector<int>a(n);
    ll sum = 0;
    unordered_map<int, int, custom_hash>mp;
    for(int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }
    sum += a[0];
    mp[a[0]]++;
    for(int i = 1; i < n; i++)
    {
        sum += a[i];
        mp[a[i]]++;
        if(mp[a[i]] >= 2) a[i] = max(a[i - 1], a[i]);
        else a[i] = a[i - 1];
    }
    unordered_map<int, int, custom_hash>mp2;
    for(int i = 1; i < n; i++)
    {
        sum += a[i];
        mp2[a[i]]++;
        if(mp2[a[i]] >= 2) a[i] = max(a[i], a[i - 1]);
        else a[i] = a[i - 1];
    }

    for(int i = 2; i < n; i++)
    {
        sum += (a[i] * (n - i));
    }
    cout << sum << endl;



}

int main()
{
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}